The Partitive Constraint in Optimality Theory

نویسندگان

  • Arto Anttila
  • Vivienne Fong
چکیده

This paper discusses a case of syntax/semantics interaction of a characteristically optimality-theoretic kind. Finnish partitive constructions exhibit a case alternation that is partly semantically, partly syntactically driven. The crucial semantic condition that plays a role in case selection is quantitative determinacy, which replaces the de niteness condition familiar from the Partitive Constraint. The crucial syntactic condition is the Case-OCP which prohibits the assignment of the same case to both the head and its sister. The syntactic and semantic constraints con ict which leads to various kinds of outcomes, including free variation and ambiguity, as well as preferences in expression and preferences in interpretation. We develop an optimality-theoretic analysis of these facts based on partially ordered optimality-theoretic grammars. In such grammars, con icts among semantic and syntactic constraints are resolved in terms of ranking. Partial ordering is crucial in deriving preferences in expression as well as interpretation, including blocking e ects.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optionality and Gradience in Persian Phonology: An Optimality Treatment

The distribution of the allophones of /?/in certain contexts involves free variation and gradient preferences. An organized survey was conducted to elicit the judgments of 37 native Persian speakers concerning the well-formedness of /?/allophonic behavior in five different phonological positions. The results showed that the differences in judgment between the various categories are not just t...

متن کامل

A semantic reanalysis of the partitive constraint * Helen

In this article a semantic reanalysis of the Partitive Constraint is given that is based on a distinction between determiners that quantify over entities and determiners that quantify over sets of entities. This leads to a straightforward analysis of problems that arose within earlier analyses of the Partitive Constraint. The reformulated Partitive Constraint simply states that NPs that are all...

متن کامل

On Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions

Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...

متن کامل

Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Semantics

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2000